DLDL: Dynamic label dictionary learning via hypergraph regularization

نویسندگان

چکیده

For classification tasks, dictionary learning based methods have attracted lots of attention in recent years. One popular way to achieve this purpose is introduce label information generate a discriminative represent samples. However, compared with traditional learning, category only achieves significant improvements supervised and has little positive influence on semi-supervised or unsupervised learning. To tackle issue, we propose Dynamic Label Dictionary Learning (DLDL) algorithm the soft matrix for unlabeled data. Specifically, employ hypergraph manifold regularization keep relations among original data, transformed labels consistent. We demonstrate efficiency proposed DLDL approach two kinds including remote sensing image human activity recognition. The demonstrated our method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic covariance estimation via positive semidefinite dictionary learning

Time series are among the most prevalent forms of data we encounter in the real world, whether it be a sequence of audio, biomedical, demographic, climate, or financial measurements. Covariance estimation, where we try to estimate the covariance matrix of a time series, is a classic and important problem that can provide us predictive power in many applications. The vast majority of covariance ...

متن کامل

Dynamic Batch Mode Active Learning via L1 Regularization

We propose a method for dynamic batch mode active learning where the batch size and selection criteria are integrated into a single formulation.

متن کامل

Multi-Label Learning with Posterior Regularization

In many multi-label learning problems, especially as the number of labels grow, it is challenging to gather completely annotated data. This work presents a new approach for multi-label learning from incomplete annotations. The main assumption is that because of label correlation, the true label matrix as well as the soft predictions of classifiers shall be approximately low rank. We introduce a...

متن کامل

Latent Semantic Learning by Efficient Sparse Coding with Hypergraph Regularization

This paper presents a novel latent semantic learning algorithm for action recognition. Through efficient sparse coding, we can learn latent semantics (i.e. high-level features) from a large vocabulary of abundant mid-level features (i.e. visual keywords). More importantly, we can capture the manifold structure hidden among midlevel features by incorporating hypergraph regularization into sparse...

متن کامل

Decentralized Dynamic Discriminative Dictionary Learning

We consider discriminative dictionary learning in a distributed online setting, where a network of agents aims to learn a common set of dictionary elements of a feature space and model parameters while sequentially receiving observations. We formulate this problem as a distributed stochastic program with a non-convex objective and present a block variant of the Arrow-Hurwicz saddle point algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neurocomputing

سال: 2022

ISSN: ['0925-2312', '1872-8286']

DOI: https://doi.org/10.1016/j.neucom.2021.12.063